On convex Bézier triangles
نویسندگان
چکیده
— Goodman [8] showed that uniform subdivision of triangular Bézier nets preserves convexity. Hère, a very short proofofthis f act is given which applies even to box spline surfaces and degree élévation instead of subdivision. Secondiy, it is shown that every Bézier net of a quadratic convex Bézier triangle can be subdivided such that the net becomes convex.
منابع مشابه
Shape Analysis of Planar Trigonometric Bézier Curves with Two Shape Parameters
The shape features of planar trigonometric Bézier curves with two shape parameters are analyzed. The necessary and sufficient conditions are derived for these curves having one or two inflection points, a loop or a cusp, or be locally or globally convex. All conditions are completely characterized by the relative position of the control polygon’s side vectors. Furthermore we discussed the influ...
متن کاملSubdivision Algorithms and Convexity Analysis for Rational Bézier Triangular Patches
Triangular surfaces are important because in areas where the geometry is not similar to rectangular domain, the rectangular surface patch will collapse into a triangular patch. In such a case, one boundary edge may collapse into a boundary vertex of the patch, giving rise to geometric dissimilarities (e.g. shape parameters, Gaussian curvature distribution, cross boundary continuities etc.) and ...
متن کاملOn Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملDecompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملPreserving Log-Convexity for Generalized Pascal Triangles
We establish the preserving log-convexity property for the generalized Pascal triangles. It is an extension of a result of H. Davenport and G. Pólya “On the product of two power series”, who proved that the binomial convolution of two log-convex sequences is log-convex.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009